Performance Analysis of QoS Routing with Network Dependant Delay Cost

This paper investigates the problem of path calcul ation of multiple metric routing. Toda 's Internet routing is based on a single metric path selecting algorithm. Single metric path is a best effort service that can only support path for one requirement. In order to support quality-of-service(QoS) call, path is subjec to multiple constraints on routing metric. In many cases, the path finding problem is NP-complete. This paper proposes widest-least cost routing algorithm that uses cost metric that is based on delay metric and inf uenced by resource bandwidth metric and network state. This algorithm is a multiple metric routing algorithm that has traffic distribution ability to serve traffic engine ring. Our goal is to select shortest path when network link is not loaded, and perform traffic engineering to move traffic to other path when network load is heavy. We have studied the performance through simulation and compared it against other routing algorithms .